Dynamically Adapting the Degree of Parallelism with Reflexive Programs
نویسندگان
چکیده
In this paper we present a new method for achieving a higher cost{e ciency on parallel computers. We insert routines into a program which detect the amount of computational work without using problem{ speci c parameters and adapt the number of used CPUs at runtime under given speedup/e ciency constraints. Several user{tunable strategies for selecting the number of processors are presented and compared. The modularity of this approach and its application{independence permit a general use on parallel computers with a scalable degree of parallelism.
منابع مشابه
Dynamically Adapting the Degree of Parallelism with Reeexive Programs
In this paper we present a new method for achieving a higher cost{eeciency on parallel computers. We insert routines into a program which detect the amount of computational work without using problem{ speciic parameters and adapt the number of used CPUs at runtime under given speedup/eeciency constraints. Several user{tunable strategies for selecting the number of processors are presented and c...
متن کاملAdaptive Parallelism on Multiprocessors: Preliminary Experience with Piranha on the CM-5
Mechanisms for sharing multiprocessors among users are still in their infancy|typical approaches include simple space-sharing and ineecient, restricted forms of time-sharing. In this work we investigate a new alternative: adaptive parallelism 2]. Adaptively parallel programs can execute over a dynamically changing set of processors; many such codes can easily and dynamically share a multiproces...
متن کاملAdaptive parallelism in compiler-parallelized code
As moderate-scale multiprocessors become widely used, we foresee an increased demand for eeective compiler parallelization and eecient management of parallelism. While parallelizing compilers are achieving success at identifying parallelism, they are less adept at predetermining the degree of parallelism in diierent program phases. Thus, a compiler-parallelized application may execute on more p...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملDTSVLIW: VLIW Performance with Sequential Code
Due to the temporal execution locality present in programs, even small instruction caches (16-Kbyte) can provide processors with fast access to instructions most of the time. The Dynamically Trace Scheduled VLIW (DTSVLIW) architecture exploits programs’ temporal execution locality by executing code in two distinct modes. In the first execution encounter, fragments of the code are executed in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996